See Tarski-Kuratowski algorithm on Wiktionary
{
"etymology_text": "Named after Alfred Tarski and Kazimierz Kuratowski.",
"forms": [
{
"form": "the Tarski-Kuratowski algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Tarski-Kuratowski algorithm",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
{
"kind": "other",
"name": "English entries with incorrect language header",
"parents": [
"Entries with incorrect language header",
"Entry maintenance"
],
"source": "w"
},
{
"kind": "other",
"name": "Pages with 1 entry",
"parents": [],
"source": "w"
},
{
"kind": "other",
"name": "Pages with entries",
"parents": [],
"source": "w"
},
{
"kind": "topical",
"langcode": "en",
"name": "Theory of computing",
"orig": "en:Theory of computing",
"parents": [
"Computer science",
"Computing",
"Sciences",
"Technology",
"All topics",
"Fundamental"
],
"source": "w"
}
],
"glosses": [
"A nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy."
],
"id": "en-Tarski-Kuratowski_algorithm-en-name--vzdvFdx",
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"nondeterministic",
"nondeterministic"
],
[
"algorithm",
"algorithm"
],
[
"upper",
"upper"
],
[
"bound",
"bound"
],
[
"complexity",
"complexity"
],
[
"formula",
"formula"
],
[
"arithmetical hierarchy",
"arithmetical hierarchy"
],
[
"analytical hierarchy",
"analytical hierarchy"
]
],
"raw_glosses": [
"(computing theory) A nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Tarski-Kuratowski algorithm"
}
{
"etymology_text": "Named after Alfred Tarski and Kazimierz Kuratowski.",
"forms": [
{
"form": "the Tarski-Kuratowski algorithm",
"tags": [
"canonical"
]
}
],
"head_templates": [
{
"args": {
"def": "1"
},
"expansion": "the Tarski-Kuratowski algorithm",
"name": "en-prop"
}
],
"lang": "English",
"lang_code": "en",
"pos": "name",
"senses": [
{
"categories": [
"English entries with incorrect language header",
"English eponyms",
"English lemmas",
"English multiword terms",
"English proper nouns",
"English uncountable nouns",
"Pages with 1 entry",
"Pages with entries",
"en:Theory of computing"
],
"glosses": [
"A nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy."
],
"links": [
[
"computing",
"computing#Noun"
],
[
"theory",
"theory"
],
[
"nondeterministic",
"nondeterministic"
],
[
"algorithm",
"algorithm"
],
[
"upper",
"upper"
],
[
"bound",
"bound"
],
[
"complexity",
"complexity"
],
[
"formula",
"formula"
],
[
"arithmetical hierarchy",
"arithmetical hierarchy"
],
[
"analytical hierarchy",
"analytical hierarchy"
]
],
"raw_glosses": [
"(computing theory) A nondeterministic algorithm that produces an upper bound for the complexity of a given formula in the arithmetical hierarchy and analytical hierarchy."
],
"topics": [
"computing",
"computing-theory",
"engineering",
"mathematics",
"natural-sciences",
"physical-sciences",
"sciences"
]
}
],
"word": "Tarski-Kuratowski algorithm"
}
Download raw JSONL data for Tarski-Kuratowski algorithm meaning in All languages combined (1.4kB)
This page is a part of the kaikki.org machine-readable All languages combined dictionary. This dictionary is based on structured data extracted on 2024-10-22 from the enwiktionary dump dated 2024-10-02 using wiktextract (eaa6b66 and a709d4b). The data shown on this site has been post-processed and various details (e.g., extra categories) removed, some information disambiguated, and additional data merged from other sources. See the raw data download page for the unprocessed wiktextract data.
If you use this data in academic research, please cite Tatu Ylonen: Wiktextract: Wiktionary as Machine-Readable Structured Data, Proceedings of the 13th Conference on Language Resources and Evaluation (LREC), pp. 1317-1325, Marseille, 20-25 June 2022. Linking to the relevant page(s) under https://kaikki.org would also be greatly appreciated.